Student Teachers’ Proof Schemes on Proof Tasks Involving Inequality: Deductive or Inductive?
نویسندگان
چکیده
منابع مشابه
Student Teachers’ Conceptions of Mathematical Proof
ion Step two is for each student teacher, individually, to produce their own representation of their conception of mathematical proof using any or all of the above key terms (or others that they might choose), arranging them on a blank piece of paper from their own perspective, and joining Mathematics Education Review, Volume 9, May 1997 pp21-32 27 key terms in what they consider a meaningful w...
متن کاملTowards Intelligent Inductive Proof Engineering
This paper deals with inductive theorem proving (ITP for short). It does not provide new theoretical results but analyses existing ITP methods from an AI point of view. The presentation is based on the implicit ITP approach, i.e. ITP using the well-developed framework of rewriting and completion techniques for systems of equations and rewrite rules. We think that the relevant practical problems...
متن کاملNarrowing Based Inductive Proof Search
Description : We present in this paper a narrowing-based proof search method for inductive theorems. It has the specificity to be grounded on deduction modulo and to yield a direct translation from a successful proof search derivation to a proof in the sequent calculus. The method is shown to be correct and refutationally complete in a proof theoretical way.
متن کاملProof Search and Proof Check for Equational and Inductive Theorems
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the Coq proof assistant and the ELAN rewriting based system, focusing first on equational and then on inductive proofs. Di...
متن کاملInductive Proof Automation for Coq
We introduce inductive proof automation for Coq that supports reasoning about inductively defined data types and recursively defined functions. This includes support for proofs involving case splits and situations where multiple inductive hypotheses appear in step case proofs. The automation uses the rippling heuristic to control rewriting in step case proofs and uses heuristics for generalisin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2018
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/947/1/012028